Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
نویسندگان
چکیده
We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute indicator of resilient functions that improves significantly (for m > (n − 3)/2) the bound of Zheng and Zhang [18] on this value. We prove new upper bound for the number of nonlinear variables in high resilient Boolean function. This result supersedes the previous record. We characterize all possible values of resiliency orders for quadratic functions and give a complete description of quadratic Boolean functions that achieve the upper bound on resiliency. We establish new necessary condition that connects the number of variables, the resiliency and the weight of an unbalanced nonconstant correlation immune function and prove that such functions do not exist for m > 0.75n−1.25. For high orders ofm this surprising fact supersedes the well-known Bierbrauer–Friedman bound [8], [1] and was not formulated before even as a conjecture. We improve the upper bound of Zheng and Zhang [18] for the nonlinearity of high order correlation immune unbalanced Boolean functions and establish that for high orders of resiliency the maximum possible nonlinearity for unbalanced correlation immune functions is smaller than for balanced.
منابع مشابه
Autocorrelation Coefficients of Two Classes of Semi-Bent Functions
Low autocorrelation is an important prerequisite of Boolean functions when used as combiners in stream ciphers. In this paper, we investigate the autocorrelation of two classes of semi-bent functions constructed by Charpin et al.. We give all the autocorrelation coefficients of these semi-bent functions and prove that they have not correlation immune. Our results show that, although these semi-...
متن کاملOn Nonlinearity and Autocorrelation Properties of Correlation Immune Boolean Functions
+ 2 2 2 2 2 2 n n and a maximum possible algebraic degree of n − 1. Moreover, we present a detailed study on the Walsh spectra of these functions. Next we study the autocorrelation values of correlation immune and resilient Boolean functions. We provide new lower bounds and related results on the absolute indicator and sum of square indicator of autocorrelation values for low orders of correlat...
متن کاملOn Algebraic Immunity of Tr ( x − 1 ) over F 2 n ?
The trace inverse function Tr(x−1) over the finite field F2n is a class of very important Boolean functions in stream ciphers, which possesses many good properties, including high algebraic degree, high nonlinearity, ideal autocorrelation, etc. In this work we discuss properties of Tr(x−1) in resistance to (fast) algebraic attacks. As a result, we prove that the algebraic immunity of Tr(x−1) ar...
متن کاملIdempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in terms of truth table representation. We exploit the idempotent structure of the PW functions and interpret them as Rotation Symmetric Boolean Functions (RSBFs). We present techniques to modify these RSBFs to introduce ze...
متن کاملOn Balanced Nonlinear Boolean Functions
This paper surveys techniques for studying and constructing balanced Boolean functions that exhibit desirable nonlinear properties including high nonlinearity, good avalanche characteristics and high orders of correlation immunity. Emphasis is placed on techniques that are of combinatorial nature, especially those that utilize extensively Hadamard matrices and hypergraphs.
متن کامل